Mechanized Reasoning for Continuous Problem Domains (Invited Talk)
نویسنده
چکیده
Specification and verification in continuous problem domains are key topics for the practical application of formal methods and mechanized reasoning. I discuss one approach to linear continuous control systems and consider the challenges and opportunities raised for mechanized reasoning. These include practical implementation and integration issues, algorithms in computational real algebraic geometry and hard open questions such as the Schanuel conjecture. I conclude with an overview of some recent new results on decidability and undecidability for vector spaces and related theories.
منابع مشابه
Mechanized Reasoning for Continuous Problem Domains
Specification and verification in continuous problem domains are key topics for the practical application of formal methods and mechanized reasoning. I discuss one approach to linear continuous control systems and consider the challenges and opportunities raised for mechanized reasoning. These include practical implementation and integration issues, algorithms in computational real algebraic ge...
متن کاملAn Introduction to Mechanized Reasoning
Mechanized reasoning uses computers to verify proofs and to help discover new theorems. Computer scientists have applied mechanized reasoning to economic problems but – to date – this work has not yet been properly presented in economics journals. We introduce mechanized reasoning to economists in three ways. First, we introduce mechanized reasoning in general, describing both the techniques an...
متن کاملEvaluation Opportunities in Mechanized Theories
When evaluating logic solvers, it is essential to take into account the application domain in which they will operate. For example, a logic solver for reasoning about programs could be applied either inside a compiler to justify the validity of optimizing transformations, or in an IDE plugin to help developers find bugs in their programs. Despite the similarity of the domain, these two applicat...
متن کاملConstraint Modelling: A Challenge for First Order Automated Reasoning (Invited Talk)
The process of modelling a problem in a form suitable for solution by constraint satisfaction or operations research techniques, as opposed to the process of solving it once formulated, requires a significant amount of reasoning. Contemporary modelling languages separate the first order description or “model” from its grounding instantiation or “data”. Properties of the model independent of the...
متن کاملContinuous Case-Based Reasoning
Case-based reasoning systems have traditionallybeen used to perform high-level reasoning in problem domains that can be adequately described using discrete, symbolic representations. However, many realworld problem domains, such as autonomous robotic navigation, are better characterized using continuous representations. Such problem domains also require continuous performance, such as continuou...
متن کامل